Some validation tests for an Algol 60 compiler
نویسنده
چکیده
This report contains details of over 100 Algol 60 test programs available from NPL which can be used to validate a compiler. Interpreting the results of the tests requires a good knowledge of Algol 60.
منابع مشابه
A x Grammars for Programming LanguagesC
AAx Grammars are members of the family of Two-Level Grammars, along with W-grammars, Metamorphosis Grammars and Attribute Grammars. In this tutorial we shall be concerned with the nature and rationale of AAx Grammars and their application in describing programming languages. Some parsing and aax evaluation methods for deterministic and nondeterministic AAx Grammars are discussed. By means of an...
متن کاملHappenings
The Happenings department reports on past, present, and future events of interest to the history of computing. These events include conferences, appropriate sessions from meetings, exhibits, projects, awards, publications, collections, general memorabilia, and important dates in the history of computing. Contributions to the department are encouraged and should consist of a description or repor...
متن کامل1970, A FORTRAN coded regular expression Compiler for IBM ..
REC (Regular Expression Compiler) is a concise programming language which allows students to write programs without knowledge of the complicated syntax of languages like FORTRAN and ALGOL. The language is recursive and contains only four elements for control. This paper describes an interpreter of REC written in FORTRAN.
متن کاملREC language is a live on IBM1130 simulator, EL lenguaje REC esta vivo en el simulador de la IBM 1130
ABSTRACT REC (Regular Expression Compiler) is a concise programming language development in mayor Mexican Universities at end of 60’s which allows students to write programs without knowledge of the complicated syntax of languages like FORTRAN and ALGOL. The language is recursive and contains only four elements for control. This paper describes use of the interpreter of REC written in FORTRAN o...
متن کاملThe Formal Termination Problem for Programs with Finite ALGOL 68-Modes
In f 1 l] the importance of the formal termination problem for a high level programming language has been pointed out. If this problem is algorithmically solvable, then the translator is at least principally able to check whether certain properties closely related to termination like macro property of programs or nonrecursivity or block behaviour of procedures are fulfilled and then to produce ...
متن کامل